Collision - Free and Continuous - CurvaturePath Planning
نویسندگان
چکیده
This paper presents a set of paths, called bi-elementary paths. These paths are smooth and feasible for a car-like robot (i.e. their tangent direction is continuous and they respect a minimum turning radius constraint), and they can be followed by a real vehicle without stopping (i.e. they have a continuous curvature proole) | which is not the case of Dubins' curves. These paths are composed of arcs of clothoid (a clothoid is a curve whose curvature is a linear function of its arc length), and are used to deene a simpliied, i.e. non complete, planner. This simpliied planner is, in turn, used in two global planning schemes, namely the Ariadne's Clew algorithm and the Probabilistic Path Planning. This paper proves an important property of the bi-elementary paths, from which the completeness of the two global planners is deduced. Praxit ele programme on urban public transports. Abstract: This paper presents a set of paths, called bi-elementary paths. These paths are smooth and feasible for a car-like robot (i.e. their tangent direction is continuous and they respect a minimum turning radius constraint), and they can be followed by a real vehicle without stopping (i.e. they have a continuous curvature proole) | which is not the case of Dubins' curves. These paths are composed of arcs of clothoid (a clothoid is a curve whose curvature is a linear function of its arc length), and are used to deene a simpliied, i.e. non complete, planner. This simpliied planner is, in turn, used in two global planning schemes, namely the Ariadne's Clew algorithm and the Probabilistic Path Planning. This paper proves an important property of the bi-elementary paths, from which the completeness of the two global planners is deduced.
منابع مشابه
Efficient Local Planning using Connection Collision Query
We introduce a novel proximity query, called connection collision query (CCQ), and use it for efficient and exact local planning in sampling-based motion planners. Given two collision-free configurations, CCQ checks whether these configurations can be connected by a given continuous path that either lies completely in the free space or penetrates any obstacle by at most ε , a given threshold. O...
متن کاملCCQ: Efficient Local Planning Using Connection Collision Query
We introduce a novel proximity query, called connection collision query (CCQ), and use it for efficient and exact local planning in sampling-based motion planners. Given two collision-free configurations, CCQ checks whether these configurations can be connected by a given continuous path that either lies completely in the free space or penetrates any obstacle by at most ε , a given threshold. O...
متن کاملSampling-based Motion Planning with High-Level Discrete Specifications
Motion planning has generally focused on computing a collision-free trajectory to a goal region. Enhancing the ability of robots in manipulation, automation, medicine, and other areas, however, often requires richer task specifications. Toward this goal, we study the problem of computing a collision-free trajectory that satisfies task specifications given by Finite Automata, STRIPS, Linear Temp...
متن کاملTowards auction-based multi-agent collision-avoidance under continuous stochastic dynamics
1. Overview We describe an approach to multi-agent planning under continuous stochastic dynamics. The approach yields collision-free state trajectories with adjustably high certainty, while aiming for low social cost. To this end we describe a collision-detection module based on a distribution-independent probabilistic bound. We employ an optimization-based approach to incrementally alter plans...
متن کاملCollision-free Path Planning Based on Clustering
The goal of collision-free path planning is to find a continuous path from a starting position to goal position without any collisions. The collision-free path planning is a critical skill in mobile robot applications, and by now it is still a tough problem because mobile robots would easily run into the situation of planning for the current path while neglecting the global goal. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997